Efficient Scalable Video Coding Based on Matching Pursuits

نویسندگان

  • Jian-Liang Lin
  • Wen-Liang Hwang
چکیده

Efficient encoding of motion residuals is essential for low-delay video applications in which videos are encoded by hybrid motion compensation and a residual encoding structure. Current standard video coding systems use hybrid motion compensation and the discrete cosine transform (DCT), where the number of bases needed to encode a residual block is the same as the number of the pixels in the block. An encoded frame is predicted from its previous reconstructed frame, and a residual image is then encoded by a non-redundant transformation, such as the DCT, or an approximation of the DCT using integer coefficients. As well as nonredundant transformation, a frame-based technique called matching pursuit (MP) has been proposed to encode motion residual images. Mallat and Zhang (Mallat & Zhang, 1993) were the first to propose a matching pursuit algorithm that decomposes a signal into a linear combination of bases within an overcomplete dictionary. Vetterli and Kalker have translated motion compensation and DCT hybrid video coding into a matching pursuit technique, and encoded frames by the matching pursuit algorithm and a dictionary composed of motion blocks and DCT bases (Vetterli & Kalker, 1994). In (Neff & Zakhor, 1997), Neff and Zakhor show that using a matching pursuit algorithm to encode motion residual images achieves a better performance than a DCT-based algorithm in terms of PSNR and perceptual quality at very low bit rates. The results in (Lin et al., 2005) also demonstrate that the matching pursuit FGS coding scheme performs better than MPEG-4 FGS at very low bit rates. Unlike a transform-based decoder, a matching pursuit decoder does not require an inverse transform; therefore, it is less complex. In a transform-based decoder, loop filtering and post processing are usually applied at very low bit rates to remove blocking and ringing artifacts, whereas a matching pursuit decoder can achieve comparable quality without such filtering and processing (Neff et al., 1998). Because the matching pursuit algorithm is a data-dependent frame-based representation, a matching pursuit video coding technique cannot be directly translated from conventional transform-based approaches. We must therefore develop a new matching pursuit video coding technique that can deal with quantization noise in the matching pursuit algorithm (Neff & Zakhor, Sept. 2000; Vleeschouwer & Zakhor, 2002), multiple description coding for reliable transmission (Tang & Zakhor, 2002), scalable bitstream generation (Al-Shaykh et al., 1999; Vleeschouwer & Macq, 2000; Rose & Regunathan, 2001), and dictionary learning and adaptation (Engan et al., 2000).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Algorithm for Realizing Matching Pursuits and its Applications in MPEG4 Coding System

Matching Pursuits is proved to be one of the most efficient techniques in various video coding techniques. However, its computation effort is so tremendous that it may not be affordable in some real-time applications. This paper presents an efficient algorithm for the implementation of Matching Pursuits. Simulation results show that the computation effort can be successfully reduced with the pr...

متن کامل

Rate Control for Layered Video Compression Using Matching Pursuits

The use of matching pursuits (MP) to compress motion compensated residual video signals and its extension to layered coding have recently been demonstrated in [1, 2]. In this paper we describe a multi-pass rate control scheme for SNR scalable encoding based on MP. The rate control algorithm enforces constant quality on each layer, while keeping the bit budget for each layer at a pre-specified t...

متن کامل

SNR Scalability with Matching Pursuits

In this paper, SNR scalable representations of video signals are studied. The investigated codecs are well suited for communications applications because they are all based on backward motion-compensated predictive coding, which provides the necessary low-delay property. In a Very-Low Bit Rate context (VLBR), the Matching Pursuits signal representation algorithm is used to represent the Displac...

متن کامل

Robust and scalable video compression using matching pursuits and absolute value coding

The main objective of this paper is to develop a fine grained scalable video codec which can fully exploit temporal correlation’s within all layers, and thus offer performance closer to that of a single layer non-scalable system. To this end we propose the use of a combination of matching pursuits together with absolute value coding of the displaced frame difference information. The proposed co...

متن کامل

Dictionaries for matching pursuits video coding

Matching pursuits is a dictionary-based coding method, which has recently been demonstrated to outperform standard techniques, such as H.263, at low bit rate video compression. Unfortunately, the method involves an extremely high computational cost, compared to the DCT-based H.263. The contribution of this paper relies on reporting three new dictionaries for matching pursuits video coding, whos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011